. M G ] 1 2 O ct 2 00 7 THE OSCILLATION STABILITY PROBLEM FOR THE URYSOHN SPHERE : A COMBINATORIAL APPROACH

نویسندگان

  • J. LOPEZ - ABAD
  • L. NGUYEN VAN THÉ
چکیده

We study the oscillation stability problem for the Urysohn sphere, an analog of the distortion problem for ℓ 2 in the context of the Urysohn space U. In particular, we show that this problem reduces to a purely combinatorial problem involving a family of countable ultrahomogeneous metric spaces with finitely many distances.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

. M G ] 9 J un 2 00 7 THE OSCILLATION STABILITY PROBLEM FOR THE URYSOHN SPHERE : A COMBINATORIAL APPROACH

We study the oscillation stability problem for the Urysohn sphere, an analog of the distortion problem for ℓ 2 in the context of the Urysohn space U. In particular, we show that this problem reduces to a purely combinatorial problem involving a family of countable ultrahomogeneous metric spaces with finitely many distances.

متن کامل

ar X iv : 0 70 6 . 13 26 v 3 [ m at h . M G ] 2 7 Fe b 20 09 THE OSCILLATION STABILITY PROBLEM FOR THE URYSOHN SPHERE : A COMBINATORIAL APPROACH

We study the oscillation stability problem for the Urysohn sphere, an analog of the distortion problem for ℓ 2 in the context of the Urysohn space U. In particular, we show that this problem reduces to a purely combinatorial problem involving a family of countable ultrahomogeneous metric spaces with finitely many distances.

متن کامل

The Urysohn Sphere Is Oscillation Stable

We solve the oscillation stability problem for the Urysohn sphere, an analog of the distortion problem for `2 in the context of the Urysohn space U. This is achieved by solving a purely combinatorial problem involving a family of countable ultrahomogeneous metric spaces with finitely many dis-

متن کامل

ar X iv : m at h / 02 04 00 7 v 3 [ m at h . C O ] 1 4 M ay 2 00 2 Fat 4 - polytopes and fatter 3 - spheres

We introduce the fatness parameter of a 4-dimensional polytope P, defined as φ(P) = ( f1 + f2)/( f0 + f3). It arises in an important open problem in 4-dimensional combinatorial geometry: Is the fatness of convex 4polytopes bounded? We describe and analyze a hyperbolic geometry construction that produces 4-polytopes with fatness φ(P) > 5.048, as well as the first infinite family of 2-simple, 2-s...

متن کامل

1 O ct 2 00 1 NEW UPPER BOUNDS ON SPHERE PACKINGS

We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to solve the sphere packing problem in dimensions 8 and 24.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008